منابع مشابه
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes deterministic automata for strings. The corresponding family of languages matches all the requirements of a robust deterministic class. Furthermore we show that, differently from the one-dimensional case, there exist many cla...
متن کاملEncapsulating Non-Determinism in Functional Logic Computations
One of the key features of the integration of functional and logic languages is the access to non-deterministic computations from the functional part of the program. In order to ensure the determinism of top-level computations in a functional logic program, which is usually a monadic sequence of I/O operations, one has to encapsulate the non-determinism (i.e., search for solutions) occurring in...
متن کاملNon-Determinism in a Functional Setting
The pure untyped Lambda Calculus augmented with an (erratic) choice operator is considered as an idealised non-deterministic functional language. Both the \may" and the \must" modalities of convergence are of interest to us. Following Abramsky's work on domain theory in logical form, we identify the deno-tational type that captures our computational situation: = P ! ] ? ] where P?] is the Plotk...
متن کاملFunctional programming and erratic non-determinism
Non-deterministic programs can represent specifications, and non-determinism arises naturally in concurrent programming languages. In this dissertation, λ-calculi exhibiting erratic nondeterminism are studied in order to identify definitions and techniques that may be applicable to higher-order programming languages for specification or concurrency. The non-deterministic λ-calculi arise as frag...
متن کاملTiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.5.514